Kantorovich Functors and Characteristic Logics for Behavioural Distances
نویسندگان
چکیده
Abstract Behavioural distances measure the deviation between states in quantitative systems, such as probabilistic or weighted systems. There is growing interest generic approaches to behavioural distances. In particular, coalgebraic methods capture variations system type (nondeterministic, probabilistic, game-based etc.), and notion of quantale abstracts over actual values take, thus covering, e.g., two-valued equivalences, (pseudo)metrics, (pseudo)metrics. Coalgebraic have been based either on liftings $$\textsf{Set}$$ Set -functors categories metric spaces, lax extensions relations. Every extension induces a functor lifting but not every comes from extension. It was shown recently that Kantorovich, i.e. induced by suitable choice monotone predicate liftings, implying via Hennessy-Milner theorem can be characterized modal logics. Here, we essentially show same more general setting liftings. lifting, indeed (quantale-valued) preserves isometries so distance (on systems suitably restricted branching degree) logic.
منابع مشابه
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L ∗ of the limit L of the first ω terms in the final sequence. L∗ is the set of points in L which arise from all coalgebras using their canonical morphisms into L, and it was used earlier for different purposes in Kurz and Pattinson [5]. Viglizzo in [11...
متن کاملKantorovich Distances between Rankings with Applications to Rank Aggregation
The goal of this paper is threefold. It first describes a novel way of measuring disagreement between rankings of a finite set X of n ≥ 1 elements, that can be viewed as a (mass transportation) Kantorovich metric, once the collection rankings of X is embedded in the set Kn of n× n doubly-stochastic matrices. It also shows that such an embedding makes it possible to define a natural notion of me...
متن کاملRhetorical biset functors, rational p-biset functors and their semisimplicity in characteristic zero
Rhetorical biset functors can be defined for any family of finite groups that is closed under subquotients up to isomorphism. The rhetorical p-biset functors almost coincide with the rational p-biset functors. We show that, over a field with characteristic zero, the rhetorical biset functors are semisimple and, furthermore, they admit a character theory involving primitive characters of automor...
متن کاملDeontic Logics for Modeling Behavioural Variability
We discuss the application of deontic logics to the modeling of variabilities in product family descriptions. Deontic logics make it possible to express concepts like permission and obligation. As a first result of this line of research, we show how a Modal Transition System, a model that has recently been proposed as an expressive way to deal with behavioural variability in product families, c...
متن کاملCharacteristic formulas over intermediate logics
We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly irreducible algebras. Moreover, we prove that there is a continuum of intermediate logics that can be axiomatized by characteristic formulas of infinite algebras ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-30829-1_3